Free groups generated by two parabolic maps
نویسندگان
چکیده
Abstract In this paper we consider a group generated by two unipotent parabolic elements of $$\textrm{SU}(2,1)$$ SU ( 2 , 1 ) with distinct fixed points. We give several conditions that guarantee the is discrete and free. also result on diameter finite $${\mathbb R}$$ R -circle in Heisenberg group.
منابع مشابه
Two Dimensional Maps Generated by Competitive Systems
By discretizing time and space in a PDE model for competitive systems, we derive the corresponding discrete maps. We analyze these maps from an analytical and numerical viewpoint with emphasis on the military interpretation of the system. For the one-species map we study the effect of convection on the bifurcation behavior and we find periodic solutions. For the two-species map, we limit our an...
متن کاملOn Infinite Groups Generated by Two Quaternions
Let x, y be two integer quaternions of norm p and l, respectively, where p, l are distinct odd prime numbers. What can be said about the structure of 〈x, y〉, the multiplicative group generated by x and y ? Under a certain condition which excludes 〈x, y〉 from being free or abelian, we show for example that 〈x, y〉, its center, commutator subgroup and abelianization are finitely presented infinite...
متن کاملCounting the Periodic Groups Generated by Two Finite Groups
In [6] Hickin and Phillips prove the existence of 2 non-isomorphic groups of exponent p for each sufficiently large prime p. The proof uses wreath products and embedding methods and relies on the existence of the infinite p-groups of Novikov and Adjan [7]. Phillips [8] had previously proved the existence of 2° non-isomorphic twogenerator p-groups for each prime p. The main theorem of this paper...
متن کاملTwo generated groups are universal
For any countable Borel equivalence relation E on a standard Borel space X, there is a Borel function θ from X to the 2-generated groups such that xEy ⇔ θ(x) ∼= θ(y) .
متن کاملAutomata with two-sided pushdowns defined over free groups generated by reduced alphabets
This paper introduces and discusses a modification of pushdown automata. This modification is based on two-sided pushdowns into which symbols are pushed from both ends. These pushdowns are defined over free groups, not free monoids, and they can be shortened only by the standard group reduction. We demonstrate that these automata characterize the family of recursively enumerable languages even ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2022
ISSN: ['1432-1823', '0025-5874']
DOI: https://doi.org/10.1007/s00209-022-03160-y